A Generalization of Lappan’s Theorem to Higher Dimensional Complex Projective Space

In this paper, the authors discuss a generalization of Lappan’s theorem to higher dimensional complex projective space and get the following result: Let f be a holomorphic mapping of ? into Pⁿ(C), and let H₁, · · · , H_q be hyperplanes in general position in Pⁿ(C).Assume that sup {(1 ? |z|²)f^?(z) : z ∈ q[ j=1 f^?1(H_j )o < ∞,if q ≥ 2n² + 3, then f is normal.     

Necessary and Sufficient Conditions for Qualitative Properties of Infinite Dimensional Linear Programming Problems

Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programing problems such as solvability, duality, and complementary slackness conditions are studied in this article. As illustrations for the results, we investigate the parametric version of Gale’s example.     

Comparison of implicit and explicit AUSM‐family schemes for compressible multiphase flows

This paper makes the first attempt of extending implicit AUSM‐family schemes to multiphase flow simulations. Water faucet, air–water shock tube and oscillating manometer problems are used as benchmark tests with the generic four‐equation two‐fluid model. For solving the equations implicitly, Newton's method along with a sparse matrix solver (UMFPACK solver) is employed, and the numerical Jacobian matrix is calculated. Comparison between implicit and explicit AUSM‐family schemes is presented, indicating that similarly accurate results are obtained with both schemes. Furthermore, the water faucet problem is solved using both staggered and collocated grids. This investigation helps integrate high‐resolution schemes into staggered‐grid‐based computational algorithms. The influence of the interface pressure correction on the simulation results is also examined. Results show that the interfacial pressure correction introduces numerical dissipation. However, this dissipation cannot eliminate the overshoots because of the incompatibility of numerical discretization of the conservative and non‐conservative terms in the governing equations. The comparison of CPU time between implicit and explicit schemes is also studied, indicating that the implicit scheme is capable of improving the computational efficiency over its explicit counterpart. Copyright © 2014 John Wiley & Sons, Ltd.     

Graph-like compacta: Characterizations and Eulerian loops

A compact graph-like space is a triple $\left(X,V,E\right)$, where $X$ is a compact, metrizable space, $V\subseteq X$ is a closed zero-dimensional subset, and $E$ is an index set such that $X⧹V\cong \text{◂+▸}E\times \left(0,1\right)$. New characterizations of compact graph-like spaces are given, connecting them to certain classes of continua, and to standard subspaces of Freudenthal compactifications of locally finite graphs. These are applied to characterize Eulerian graph-like compacta.     

Stability of a von Karman equation with infinite memory

In this paper, we consider a von Karman equation with infinite memory. For von Karman equations with finite memory, there is a lot of literature concerning on existence of the solutions, decay of the energy, and existence of the attractors. However, there are few results on existence and energy decay rate of the solutions for von Karman equations with infinite memory. The main goal of the present paper is to generalize previous results by treating infinite history instead of finite history.     

Degasperis-Procesi方程的类孤子新解

利用辅助方程与函数变换相结合的方法,构造了Degasperis-Procesi(D-P)方程的无穷序列类孤子新解.首先,通过两种函数变换,把D-P方程化为常微分方程组.然后,利用常微分方程组的首次积分,把D-P方程的求解问题化为几种常微分方程的求解问题.最后,利用几种常微分方程的Bcklund变换等相关结论,构造了D-P方程的无穷序列类孤子新解.这里包括由Riemannθ函数、Jacobi椭圆函数、双曲函数、三角函数和有理函数组成的无穷序列光滑孤立子解、尖峰孤立子解和紧孤立子解.     

Blow‐up for the b‐family of equations

In this paper, we consider the b‐family of equations on the torus u _t ?u _{t x x} +(b + 1)u u _x =b u _x u _{x x} +u u _{x x x} , which for appropriate values of b reduces to well‐known models, such as the Camassa–Holm equation or the Degasperis–Procesi equation. We establish a local‐in‐space blow‐up criterion. Copyright © 2016 John Wiley & Sons, Ltd.